The spectra of super line multigraphs
نویسندگان
چکیده
For an arbitrary simple graph G and a positive integer r, the super line multigraph of index r of G, denoted Mr(G), has for vertices all the r-subsets of edges. Two vertices S and T are joined by as many edges as pairs of distinct edges s ∈ S and t ∈ T share a common vertex in G. We present spectral properties ofMr(G) and particularly, if G is a regular graph, we calculate all the eigenvalues ofMr(G) and their multiplicities in terms of those of G.
منابع مشابه
On restricted edge-connectivity of half-transitive multigraphs
Let G = (V,E) be a multigraph (it has multiple edges, but no loops). We call G maximally edge-connected if λ(G) = δ(G), and G super edge-connected if every minimum edge-cut is a set of edges incident with some vertex. The restricted edgeconnectivity λ′(G) of G is the minimum number of edges whose removal disconnects G into non-trivial components. If λ′(G) achieves the upper bound of restricted ...
متن کاملQuartic Graphs with Every Edge in a Triangle
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from the line multigraphs of cubic multigraphs by a number of simple subgraph-replacement operations. A corollary of this is that a simple quartic graph with every e...
متن کاملLine completion number of grid graph Pn × Pm
The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...
متن کاملEnumeration of the Degree Sequences of Line–hamiltonian Multigraphs
Recently, Gu, Lai and Liang proved necessary and sufficient conditions for a given sequence of positive integers d1, d2, . . . , dn to be the degree sequence of a line– Hamiltonian multigraph. Our goal in this note is to utilize this result to prove a closed formula for the function dlh(2m), the number of degree sequences with degree sum 2m representable by line–Hamiltonian multigraphs. Indeed,...
متن کاملPartitions and Edge Colourings of Multigraphs
Erdős and Lovász conjectured in 1968 that for every graph G with χ(G) > ω(G) and any two integers s, t ≥ 2 with s+ t = χ(G)+1, there is a partition (S, T ) of the vertex set V (G) such that χ(G[S]) ≥ s and χ(G[T ]) ≥ t. Except for a few cases, this conjecture is still unsolved. In this note we prove the conjecture for line graphs of multigraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008